def sum(n, S):
out = 0
i = 0
j = 0
Loc = "*"
for c in S:
if c == "U":
i += 1
if c == "R":
j += 1
prevLoc = Loc
if i > j and prevLoc != "L":
if Loc != "*":
out += 1
Loc = "L"
elif i < j and prevLoc != "R":
if Loc != "*":
out += 1
Loc = "R"
return out
return out
n = input()
S = input()
print(sum(n, S))
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |
Differences of the permutations | Doctor's Secret |
Back to School | I am Easy |
Teddy and Tweety | Partitioning binary strings |
Special sets | Smallest chosen word |